#include<iostream>
#include <string>
#include<algorithm>
#include <cmath>
#include <cstdio>

using namespace std;

int main()
{
	int n, m, i, j
		string p;
	while (m)
	{
		p.push_back(((m & 1) == 1 ? '1' : '0'));
		m = m >> 1;
	}
	reverse(p.begin(), p.end());

	int ans = 0;
	for (int k = i; k <= j && ans < p.size(); k++)
	{
		n = n & ((p[ans++] - '0') << (k));
	}
	return 0;
}